Deadlock-Free Multicasting in Irregular Networks Using Prefix Routing
نویسندگان
چکیده
منابع مشابه
Deadlock-Free Routing In Irregular Networks Using Prefix Routing
In this paper, we propose a deadlock-free routing in irregular networks using pre x routing. Pre x routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a pre x of the label of the destination node. Node and channel labelin...
متن کاملDeadlock-Free Multicasting in Irregular Networks
A deadlock-free multicast scheme called prefix multicasting in irregular networks is studied. In prefix routing, a compact routing table is associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular networ...
متن کاملDeadlock-free Routing in Irregular Networks Using Preex Routing
In this paper we propose a deadlock free routing in irregular networks using pre x routing Pre x routing is a special type of routing with a compact routing table associated with each node processor Basically each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a pre x of the label of the destination node Node and channel labeling in an...
متن کاملDeadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks
EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...
متن کاملDeadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
This paper considers the problem of electing a leader ina dynamic ring in which processors are permitted to fail and recoverduring election. e( n log n + I;, ) messages, when counting only messagessent by functional processors, are shown to be necessary and sufficientfor dynamic ring election, where I;v is the number of processor recoveriesexperienced.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2005
ISSN: 0920-8542
DOI: 10.1023/b:supe.0000049325.58858.72